Experiments on data reduction for optimal domination in networks

نویسندگان

  • Jochen Alber
  • Nadja Betzler
  • Rolf Niedermeier
چکیده

We present empirical results on computing optimal dominating sets in networks by means of data reduction through preprocessing rules. Thus, we demonstrate the usefulness of so far only theoretically considered reduction techniques for practically solving one of the most important network problems in combinatorial optimization. keywords Graph Theory, Location, Topological Design, Network Models, Operations Research

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modeling gene regulatory networks: Classical models, optimal perturbation for identification of network

Deep understanding of molecular biology has allowed emergence of new technologies like DNA decryption.  On the other hand, advancements of molecular biology have made manipulation of genetic systems simpler than ever; this promises extraordinary progress in biological, medical and biotechnological applications.  This is not an unrealistic goal since genes which are regulated by gene regulatory ...

متن کامل

Optimal Control Pressure for Leakage Minimization in Water Distribution Systems Using Imperialist Competitive Algorithm

One of the key factors affecting leakage in water distribution systems is network pressure management by putting Pressure Reduce Valves (PRV) in the flow path and optimal regulation of these vales in water networks. This study aimed at investigating optimal pressure management problems so as to minimize leakage in water distribution networks. To do so, an approach was proposed for both optimal ...

متن کامل

On exponential domination and graph operations

An exponential dominating set of graph $G = (V,E )$ is a subset $Ssubseteq V(G)$ such that $sum_{uin S}(1/2)^{overline{d}{(u,v)-1}}geq 1$ for every vertex $v$ in $V(G)-S$, where $overline{d}(u,v)$ is the distance between vertices $u in S$ and $v  in V(G)-S$ in the graph $G -(S-{u})$. The exponential domination number, $gamma_{e}(G)$, is the smallest cardinality of an exponential dominating set....

متن کامل

Optimal Capacitor Allocation in Radial Distribution Networks for Annual Costs Minimization Using Hybrid PSO and Sequential Power Loss Index Based Method

In the most recent heuristic methods, the high potential buses for capacitor placement are initially identified and ranked using loss sensitivity factors (LSFs) or power loss index (PLI). These factors or indices help to reduce the search space of the optimization procedure, but they may not always indicate the appropriate placement of capacitors. This paper proposes an efficient approach for t...

متن کامل

Optimal energy management of the photovoltaic based distribution networks considering price responsive loads, energy storage systems and convex power flows.

Nowadays, presence of photovoltaic systems in distribution network is not without challenge and it may not have economic productivity for the system under the lack of optimal management. Energy storage systems are able to cope with this problem. Therefore, in this paper, a new method is proposed for energy management of the distribution networks in order to show that how presence of the energy ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Annals OR

دوره 146  شماره 

صفحات  -

تاریخ انتشار 2006